Dynamically Detecting and Exploiting Symmetry in Finite Constraint Satisfaction Problems
نویسندگان
چکیده
منابع مشابه
Breaking Symmetries in Distributed Constraint Programming Problems
Though various preprocessing techniques have been studied for improving the performance of distributed constraint satisfaction problems, no approach for detecting and breaking symmetries has been studied in depth. In this paper, we describe a method for detecting some symmetries of a given distributed problem and for exploiting them. Then, we validate it as a preprocessing method forAdopt andDp...
متن کاملUsing Symmetry of Global Constraints to Speed up the Resolution of Constraint Satisfaction Problems
1 LIP6, Boîte 169, 4 Place Jussieu, 75 252 Paris Cedex 05, France. e-mail: [email protected] 2 SONY CSL-Paris, 6 rue Amyot, 75 005 Paris, France. e-mail: [email protected] Abstract. Symmetry in constraint satisfaction problems (CSP) can be used to either compute only a subset of the total solution set, or to prune branches of the search tree. However, detecting symmetry in general is a diffic...
متن کاملExploiting Symmetry in Lifted CS
When search problems have large-scale symmetric structure, detecting and exploiting that structure can greatly reduce the size of the search space. Previous work has shown how to find and exploit symmetries in propositional encodings of constraint satisfaction problems (CSPs). Here we consider problems that have more compact “lifted” (quantified) descriptions from which propositional encodings ...
متن کاملExploiting symmetries within constraint satisfaction search
Symmetry often appears in real-world constraint satisfaction problems, but strategies for exploiting it are only beginning to be developed. Here, a framework for exploiting symmetry within depth-first search is proposed, leading to two heuristics for variable selection and a domain pruning procedure. These strategies are then applied to two highly symmetric combinatorial problems, namely the Ra...
متن کاملStudy of symmetry in Constraint Satisfaction Problems ?
Constraint satisfaction problems (CSP's) involve nding values for variables subject to constraints on which combinations of values are permitted. Symmetrical values of a CSP variable are in a sense redundant. Their removal will simplify the problem space. In this paper we give the principle of symmetry and show that the concept of interchangeability introduced by Freuder, is a particular case o...
متن کامل